True Concurrency can be Traced
نویسنده
چکیده
In this paper sets of labelled partial orders are employed as fundamental mathematical entities for modelling nondeterministic and concurrent processes thereby obtaining so-called noninterleaving semantics. Based on closures of sets of labelled partial orders, a simple recursive algebraic language with refinement is given denotational models fully abstract w.r.t. corresponding behaviourally motivated equivalences.
منابع مشابه
Versioning and Concurrency Control in a Distributed Design Environment
This paper describes a design data management method in a distributed design environment. This method i s based on the detection of the difference between the original design data and modified design data. One of the advantages of this method is that the precise difference can be identified among versions. Exploiting this feature, the history of modifications of design data can be traced and th...
متن کاملLocality and True-concurrency in Calculi for Mobile Processes
Process algebra semantics can be categorised into true-concurrency semantics, where parallel composition is considered a primitive operator, and interleaving semantics, where concurrency is reduced to sequentiality plus non-determinism. The former have an appealing intuitive justiication, but the latter are mathematically more tractable. This paper addresses the study of true-concurrency semant...
متن کاملAlgebraic Laws for True Concurrency
We find the algebraic laws for true concurrency. Eventually, we establish a whole axiomatization for true concurrency called APTC (Algebra for Parallelism in True Concurrency). The theory APTC has four modules: BATC (Basic Algebra for True Concurrency), APTC (Algebra for Parallelism in True Concurrency), recursion and abstraction. And also, we show the applications and extensions of APTC.
متن کاملWeakly True Concurrency and Its Logic
We firstly find the existence of silent event τ in true concurrency (named weakly true concurrency) by defining weakly true concurrent behaviors and weakly true concurrent logics. Based on Paolo Baldan and Silvia Crafa’s comprehensive work on (strongly) true concurrency, we find the correspondence between weakly true concurrent equivalences and weakly true concurrent logics.
متن کاملImplementing Condition/Event Nets in the Circal Process Algebra
We define a translation from Condition/Event nets to the Circal process algebra. Such a translation exploits the Circal feature of allowing the simultaneous occurrence of distinct actions. This permits us to give Condition/Event nets a semantics based on true concurrency, in addition to the interleaving-based semantics. In this way the true concurrency aspects of Condition/Event nets are preser...
متن کامل